Iterative methods for low rank approximation of graph similarity matrices
نویسندگان
چکیده
منابع مشابه
Non-iterative generalized low rank approximation of matrices
As an extension to 2DPCA, Generalized Low Rank Approximation of Matrices (GLRAM) applies two-sided (i.e., the left and right) rather than single-sided (i.e., the left or the right alone) linear projecting transform(s) to each 2D image for compression and feature extraction. Its advantages over 2DPCA include higher compression ratio and superior classification performance etc. However, GLRAM can...
متن کاملIterative Low-Rank Approximation for CNN Compression
Deep convolutional neural networks contain tens of millions of parameters, making them impossible to work efficiently on embedded devices. We propose iterative approach of applying low-rank approximation to compress deep convolutional neural networks. Since classification and object detection are the most favored tasks for embedded devices, we demonstrate the effectiveness of our approach by co...
متن کاملImprovements of two preconditioned AOR iterative methods for Z-matrices
In this paper, we propose two preconditioned AOR iterative methods to solve systems of linear equations whose coefficient matrices are Z-matrix. These methods can be considered as improvements of two previously presented ones in the literature. Finally some numerical experiments are given to show the effectiveness of the proposed preconditioners.
متن کاملSymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering
Nonnegative matrix factorization (NMF) provides a lower rank approximation of a matrix by a product of two nonnegative factors. NMF has been shown to produce clustering results that are often superior to those by other methods such as K-means. In this paper, we provide further interpretation of NMF as a clustering method and study an extended formulation for graph clustering called Symmetric NM...
متن کاملRandomized algorithms for the low-rank approximation of matrices.
We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application (inter alia) to the evaluation of the singular value decompositions of numerically low-rank matrices. Being probabilistic, the schemes described here have a finite probability of failure; in most cases, this probability is rather negligible (10(-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2013
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.12.004